Lower bounds on probabilistic linear decision trees
نویسندگان
چکیده
منابع مشابه
Average-Case Lower Bounds for Noisy Boolean Decision Trees
We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous resu...
متن کاملProbabilistic Characterization of Decision Trees Probabilistic Characterization of Decision Trees
In this paper we use the methodology introduced in Dhurandhar and Dobra (2006) for analyzing the error of classifiers and the model selection measures, to analyze decision tree algorithms. The methodology consists of obtaining parametric expressions for the moments of the Generalization error (GE) for the classification model of interest, followed by plotting these expressions for interpritabil...
متن کاملGeneralization Bounds for Decision Trees
We derive a new bound on the error rate for decision trees. The bound depends both on the structure of the tree and the specific sample (not just the size of the sample). This bound is tighter than traditional bounds for unbalanced trees and justifies “compositional” algorithms for constructing decision trees.
متن کاملLower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees
We describe a new method for proving lower bounds for algebraic decision trees. We prove, for the rst time, that the minimum depth for arbitrary decision trees for the problem of testing the membership to a polygon with N nodes is (log N). Moreover, we prove that the corresponding lower bound for the randomized decision trees matches the above bound. Finally, we prove that for the algebraic exp...
متن کاملLower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes
We introduce a complexity measure for decision trees called the soft rank, which measures how wellbalanced a given tree is. The soft rank is a somehow relaxed variant of the rank. Among all decision trees of depth d, the complete binary decision tree (the most balanced tree) has maximum soft rank d, the decision list (the most unbalanced tree) has minimum soft rank √ d, and any other trees have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90210-5